Combinatorial Geometry of Graph Partitioning - I

نویسنده

  • Manjish Pal
چکیده

The c-Balanced Separator problem is a graph-partitioning problem in which given a graph G, one aims to find a cut of minimum size such that both the sides of the cut have at least cn vertices. In this paper, we present new directions of progress in the c-Balanced Separator problem. More specifically, we propose a family of mathematical programs, that depend upon a parameter p > 0, and is an extension of the uniform version of the SDPs proposed by Goemans and Linial for this problem. In fact for the case, when p = 1, if one can solve this program in polynomial time then simply using the Goemans-Williamson’s randomized rounding algorithm for Max Cut [11] will give an O(1)-factor approximation algorithm for c-Balanced Separator improving the best known approximation factor of O( √ logn) due to Arora, Rao and Vazirani [4]. This family of programs is not convex but one can transform them into so called concave programs in which one optimizes a concave function over a convex feasible set. It is well known that the optima of such programs lie at one of the extreme points of the feasible set [26]. Our main contribution is a combinatorial characterization of some extreme points of the feasible set of the mathematical program, for p = 1 case, which to the best of our knowledge is the first of its kind. We further demonstrate how this characterization can be used to solve the program in a restricted setting. Non-convex programs have recently been investigated by Bhaskara and Vijayaraghvan [6] in which they design algorithms for approximating Matrix pnorms although their algorithmic techniques are analytical in nature. It is important to note that the properties of concave programs allows one to apply techniques due to Hoffman [18] or Tuy et al [26] to solve such problems with arbitrary accuracy that, for special forms of concave programs, converge in polynomial time. A significant portion of this work was done when the author was a B-Tech, M-Tech dual degree student at IIT-Kanpur, India ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 184 (2010)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research Statement Jeong -

My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...

متن کامل

Jeong - Hyun

My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...

متن کامل

THIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM

Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...

متن کامل

Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut

This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...

متن کامل

Research Statements

Over the past two decades, I have been working on problems at the intersection of Algorithm Design, Optimization, Algorithmic Game and Economics Theories, Scientific Computation, and Parallel Processing. I am a theoretican who cares a lot about the practical impact of mathematical and algorithmic work and who appreciates interdisciplinary research. My main research interests include Smoothed An...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010